Locally Well-Dominated and Locally Independent Well-Dominated Graphs
نویسندگان
چکیده
منابع مشابه
Locally Well-Dominated and Locally Independent Well-Dominated Graphs
In this article we present characterizations of locally well-dominated graphs and locally independent well-dominated graphs, and a sufficient condition for a graph to be k-locally independent well-dominated. Using these results we show that the irredundance number, the domination number and the independent domination number can be computed in polynomial time within several classes of graphs, e....
متن کاملWell-dominated graphs without cycles of lengths 4 and 5
Let G be a graph. A set S of vertices in G dominates the graph if every vertex of G is either in S or a neighbor of a vertex in S. Finding a minimal cardinality set which dominates the graph is an NP-complete problem. The graph G is well-dominated if all its minimal dominating sets are of the same cardinality. The complexity status of recognizing well-dominated graphs is not known. We show that...
متن کاملWell-dispersed subsets of non-dominated solutions for MOMILP problem
This paper uses the weighted L$_1-$norm to propose an algorithm for finding a well-dispersed subset of non-dominated solutions of multiple objective mixed integer linear programming problem. When all variables are integer it finds the whole set of efficient solutions. In each iteration of the proposed method only a mixed integer linear programming problem is solved and its optimal solutions gen...
متن کاملwell-dispersed subsets of non-dominated solutions for momilp problem
this paper uses the weighted l$_1-$norm to propose an algorithm for finding a well-dispersed subset of non-dominated solutions of multiple objective mixed integer linear programming problem. when all variables are integer it finds the whole set of efficient solutions. in each iteration of the proposed method only a mixed integer linear programming problem is solved and its optimal solutions gen...
متن کاملLocally Well Generated Homotopy Categories of Complexes
We show that the homotopy category of complexes K(B) over any finitely accessible additive category B is locally well generated. That is, any localizing subcategory L in K(B) which is generated by a set is well generated in the sense of Neeman. We also show that K(B) itself being well generated is equivalent to B being pure semisimple, a concept which naturally generalizes right pure semisimpli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 2003
ISSN: 0911-0119,1435-5914
DOI: 10.1007/s00373-002-0507-7